A simple proof of the uniform consensus synchronous lower bound
نویسندگان
چکیده
We give a simple and intuitive proof of an f + 2 round lower bound for uniform consensus. That is, we show that for every uniform consensus algorithm tolerating t failures, and for every f t − 2, there is an execution with f failures that requires f + 2 rounds. 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
A bivalency proof of the lower bound for uniform consensus
Bivalency argument is a widely-used technique that employs forward induction to show impossibility results and lower bounds related to consensus. However, for a synchronous distributed system of n processes with up to t potential and f actual crash failures, applying bivalency argument to prove the lower bound for reaching uniform consensus is still an open problem. In this paper, we address th...
متن کاملA Unified Proof of Minimum Time Complexity for Reaching Consensus and Uniform Consensus - An Oracle-Based Approach
In this paper, we offer new proofs to two lower bound results in distributed computing: a minimum of f + 1 and f + 2 rounds for reaching consensus and uniform consensus respectively when at most f fail-stop faults can happen. Here the computation model is synchronous message passing. Both proofs are based on a novel oracle argument. These two induction proofs are unified in the following sense:...
متن کاملUniform Agreement Despite Process Omission Failures
A process fails by omission if it “forgets” to send or receive messages. Considering omission failures is crucial for distributed systems, as such failures model both crash failures and incorrect behavior of process input/output buffers (such as buffer overflow). So, designing protocols that cope not only with crash failures but also with omission failures is a real challenge as soon as one is ...
متن کاملA Simple Analytic Method to Model and Detect Non-Uniform Air-Gaps in Synchronous Generators
The air-gap of electrical machines may become non-uniform due to low accuracy of the manufacturing machinery, in assembling processes, or by aging. Detection and monitoring of this phenomenon is very important and of interest. There are several methods to model non-uniform air-gaps and to detect them by monitoring systems. One of the most widely used methods is by the analysis of the line curre...
متن کاملUniform consensus is harder than consensus
We compare the consensus and uniform consensus problems in synchronous systems. In contrast to consensus, uniform consensus is not solvable with byzantine failures. This still holds for the omission failure model if a majority of processes may be faulty. For the crash failure model, both consensus and uniform consensus are solvable, no matter how many processes are faulty. In this failure model...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 85 شماره
صفحات -
تاریخ انتشار 2003